Ant Search Strategies For Planning Optimization
نویسندگان
چکیده
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard computational problem. Stochastic methods do not guarantee either optimality or completeness, but it has been proved that in many applications they are able to find very good, often optimal, solutions. We propose several approaches based both on backward and forward search over the state space, using several heuristics and testing different pheromone models in order to solve sequential optimization planning problems.
منابع مشابه
An Improved Ant Colony Optimization for the Multi-Robot Path Planning with Timeliness
To achieve efficient search performance for the multi-robot system which carries out the goal search task with consideration of timeliness, a multi-robot collaborative path planning system is designed to guide the robots during the search process. In the system, a planning method based on an Improved Ant Colony Optimization (IACO) algorithm is proposed. In the solution procedure, the path cost ...
متن کاملAn effective hybrid algorithm for mobile robot global path planning
Ant Colony Optimization (ACO) exhibits parallelism, contains certain redundancy and historical information of the past solutions with pheromone trail, and is suitable for implementation on massively parallel architecture. But it is not easy to avoid local optima, especially for large-scale schedule problems. Simulated annealing (SA) is a naturally serial algorithm, but its behavior can be contr...
متن کاملThe Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility
In the first part of this paper, we present the Optimal Searcher Path problem with Visibility, a novel path planning approach that models interregion visibility and that uses concepts from search theory to model uncertainty on the goal’s (i.e., the search object) detectability and location. In the second part, we introduce the Ant Search algorithm, a solving technique based on ant colony optimi...
متن کاملA hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem
The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009